On Rough Algebras

نویسندگان

  • DAI Jian-Hua
  • PAN Yun-He
چکیده

Description of the pairs 〈low approximation, upper approximation〉 of rough sets is an important aspect in the research of rough set theory by algebraic method. By defining some basic operators on the approximation pairs, rough algebras can be constructed. Then some general algebras can be selected to describe the pairs of rough sets. The most famous rough algebras are Rough Double Stone Algebra, Rough Nelson Algebra and Approximation Space Algebra, and their corresponding general algebra structures are regular double Stone algebra, semi-simple Nelson algebra and pre-rough algebra respectively. This paper establishes the relations between the operators of these rough algebras and proves that: (a) approximation space algebra can be made into semi-simple Nelson algebra or regular double Stone algebra; (b) rough Nelson algebra can be made into pre-rough algebra or regular double Stone algebra; (c) rough double Stone algebra can be made into pre-rough algebra or semi-simple Nelson algebra. Thus, a uniform structure for the famous works from three different aspects is built and the relations among them are established.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rough implication operator based on strong topological rough algebras

The role of topological De Morgan algebra in the theory of rough sets is investigated. The rough implication operator is introduced in strong topological rough algebra that is a generalization of classical rough algebra and a topological De Morgan algebra. Several related issues are discussed. First, the two application directions of topological De Morgan algebras in rough set theory are descri...

متن کامل

Rough operations on Boolean algebras

In this paper, we introduce two pairs of rough operations on Boolean algebras. First we define a pair of rough approximations based on a partition of the unity of a Boolean algebra. We then propose a pair of generalized rough approximations on Boolean algebras after defining a basic assignment function between two different Boolean algebras. Finally, some discussions on the relationship between...

متن کامل

Generalized Rough Logics with Rough Algebraic Semantics

The collection of the rough set pairs of an approximation (U, R) can be made into a Stone algebra by defining two binary operators and one unary operator on the pairs. By introducing a more unary operator, one can get a regular double Stone algebra to describe the rough set pairs of an approximation space. Sequent calculi corresponding to the rough alg...

متن کامل

Soft Rough Bci-algebras and Corresponding Decision Making

In this paper, we study soft rough BCI-algebras with respect to MSapproximation spaces. Some new soft rough operations over BCI-algebras are explored. In particular, lower and upper soft rough BCI-algebras with another soft set are investigated. Finally, a kind of decision making method for soft rough BCI-algebras are originally investigated.

متن کامل

A Logic for Rough Sets

The collection of all subsets of a set forms a Boolean algebra under the usual set theoretic operations, while the collection of rough sets of an approximation space is a regular double Stone algebra [24]. The appropriate class of algebras for classical propositional logic are Boolean algebras, and it is reasonable to assume that regular double Stone algebras are a class of algebras appropriate...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005